Multiplicative finite difference methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplicative Finite Difference Methods

Based on multiplicative calculus, the finite difference schemes for the numerical solution of multiplicative differential equations and Volterra differential equations are presented. Sample problems were solved using these new approaches.

متن کامل

Finite Difference Methods

In this notes, we summarize numerical methods for solving Stokes equations on rectangular grid, and solve it by multigrid vcycle method with distributive Gauss-Seidel relaxation as smoothing. The numerical methods we concerned are MAC scheme, nonconforming rotate bilinear FEM and nonconforming rotate bilinear FVM. 1. PROBLEM STATEMENT We consider Stokes equation (1.1) 8 >< >: μ ~ u +rp =~ f in ...

متن کامل

Finite Difference Methods

1 STATEMENT OF THE PROBLEM Our goal is to introduce how derivatives can be approximated by using difference quotients. Suppose we have an interval [a,b] ⊂ R. Let a = x0 < x1 < ·· · < xN−1 < xN = b be a partition. We call {x1, . . . , xN−1} the interior points, and {x0, xN } the boundary. Given a function f : [a,b] → R, we want to approximate the derivative f ′ using our partition. 2 DIFFERENCE ...

متن کامل

Multiplicative valued difference fields

The theory of valued difference fields (K,σ, v) depends on how the valuation v interacts with the automorphism σ. Two special cases have already been worked out the isometric case, where v(σ(x)) = v(x) for all x ∈ K, has been worked out by Luc Belair, Angus Macintyre and Thomas Scanlon; and the contractive case, where v(σ(x)) > nv(x) for all x ∈ K× with v(x) > 0 and n ∈ N, has been worked out b...

متن کامل

Finite difference methods for approximating Heaviside functions

We present a finite difference method for discretizing a Heaviside function H(u(~x)), where u is a level set function u : Rn 7→ R that is positive on a bounded region Ω ⊂ R. There are two variants of our algorithm, both of which are adapted from finite difference methods that we proposed for discretizing delta functions in [13–15]. We consider our approximate Heaviside functions as they are use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quarterly of Applied Mathematics

سال: 2009

ISSN: 0033-569X,1552-4485

DOI: 10.1090/s0033-569x-09-01158-2